The Complexity of Node Counting on Undirected Graphs
نویسندگان
چکیده
We analyze the complexity of Node Counting, a graph-traversal method. On many graphs arising in control problems in Artificial Intelligence, Node Counting performs as efficiently as other methods which are known to be of polynomial complexity in the number of states (e.g., Learning Real-Time A* method). We show that complexity of Node Counting on undirected graphs is (n p ), which is not polynomial in the number of states. This solves an open problem from the literature.
منابع مشابه
Tree-width and Logspace: Determinants and Counting Euler Tours
Motivated by the recent result of [EJT10] showing that MSO properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of a bounded tree-width graph and prove that it is L-complete. It is important to notice that the determinant is neither an MSO-property nor counts the number of solutions of an MSO-predicat...
متن کاملCounting Euler Tours in Undirected Bounded Treewidth Graphs
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel by proving a GapL ⊆ NC ⊆ P upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main technical contribution is to show how (an instance of) dynamic programming on bounded clique-width graphs can be performed efficiently in parallel. Thus we show...
متن کاملReplacement Paths via Row Minima of Concise Matrices
Matrix M is k-concise if the finite entries of each column of M consist of k or fewer intervals of identical numbers. We give an O(n + m)-time algorithm to compute the row minima of any O(1)-concise n×m matrix. Our algorithm yields the first O(n+m)-time reductions from the replacement-paths problem on an n-node m-edge undirected graph (respectively, directed acyclic graph) to the single-source ...
متن کاملA Computational Proof of Complexity of Some Restricted Counting Problems
We explore a computational approach to proving the intractability of certain counting problems. These problems can be described in various ways, and they include concrete problems such as counting the number of vertex covers or independent sets for 3regular graphs. The high level principle of our approach is algebraic, which provides sufficient conditions for interpolation to succeed. Another a...
متن کاملBounded Depth Arithmetic Circuits: Counting and Closure
Constant-depth arithmetic circuits have been defined and studied in [AAD97, ABL98]; these circuits yield the function classes #AC and GapAC. These function classes in turn provide new characterizations of the computational power of threshold circuits, and provide a link between the circuit classes AC (where many lower bounds are known) and TC (where essentially no lower bounds are known). In th...
متن کامل